class KthLargest {
public:
    KthLargest(int k, vector<int>& nums) {
        _k = k;
        for(auto x : nums)
        {
            heap.push(x);
            if(heap.size() > _k)
                heap.pop();
        }
    }
    
    int add(int val) {
        heap.push(val);
        if(heap.size() > _k)
            heap.pop();
        return heap.top();
    }
private:
    // 创建一个大小为 k 的小堆
    priority_queue<int, vector<int>, greater<int>> heap;
    int _k;
};

/**
 * Your KthLargest object will be instantiated and called as such:
 * KthLargest* obj = new KthLargest(k, nums);
 * int param_1 = obj->add(val);
 */